Extending precolorings to distinguish group actions
نویسندگان
چکیده
منابع مشابه
Extending Precolorings to Distinguish Group Actions
Given a group Γ acting on a set X, a k-coloring φ : X → {1, . . . , k} of X is distinguishing with respect to Γ if the only γ ∈ Γ that fixes φ is the identity action. The distinguishing number of the action Γ, denoted DΓ(X), is then the smallest positive integer k such that there is a distinguishing k-coloring of X with respect to Γ. This notion has been studied in a number of settings, but by ...
متن کاملExtending precolorings to circular colorings
Fix positive integers k′, d′, k, d such that k′/d′ > k/d ≥ 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at least 2 ⌈ kk′ 2(k′d−kd′) ⌉ , then every coloring of P with colors in Zk′ extends to a (k′, d′)coloring of G. If k′d − kd′ = 1 and $k′/d′% = $k/d%, then this distance threshold is nearly sharp. The proof of this includes sho...
متن کاملExtending Fractional Precolorings
For every d ≥ 3 and k ∈ {2} ∪ [3,∞), we determine the smallest ε such that every fractional (k + ε)-precoloring of vertices at mutual distance at least d of a graph G with fractional chromatic number equal to k can be extended to a proper fractional (k + ε)-coloring of G. Our work complements the analogous results of Albertson for ordinary colorings and those of Albertson and West for circular ...
متن کاملExtending Finite Group Actions from Surfaces to Handlebodies
We show that every action of a finite dihedral group on a closed orientable surface F extends to a 3-dimensional handlebody V , with ∂V = F . In the case of a finite abelian group G, we give necessary and sufficient conditions for a G-action on a surface to extend to a compact 3-manifold, or, equivalently in this case, to a 3-dimensional handlebody; in particular all (fixed-point) free actions ...
متن کاملExtending precolorings of subgraphs of locally planar graphs
Let G be a graph embedded on a surface with all noncontractible cycles sufficiently long, called a locally planar graph. With Michael Albertson we have shown that if a set of vertices of G, at sufficiently large, mutual distance, are precolored with five colors, then this coloring extends to a 5-coloring of G. The precolored extension 5-color theorem holds if bipartite subgraphs, sufficiently f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2018
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.03.008